منابع مشابه
Isometric Piecewise Polynomial Curves
The main preoccupations of research in computer-aided geometric design have been on shape-speciication techniques for polynomial curves and surfaces, and on the continuity between segments or patches. When modelling with such techniques, curves and surfaces can be compressed or expanded arbitrarily. There has been relatively little work on interacting with direct spatial properties of curves an...
متن کاملPiecewise-Polynomial Regression Trees∗
A nonparametric function estimation method called SUPPORT (“Smoothed and Unsmoothed Piecewise-Polynomial Regression Trees”) is described. The estimate is typically made up of several pieces, each piece being obtained by fitting a polynomial regression to the observations in a subregion of the data space. Partitioning is carried out recursively as in a tree-structured method. If the estimate is ...
متن کاملPiecewise quadratic trigonometric polynomial curves
Analogous to the quadratic B-spline curve, a piecewise quadratic trigonometric polynomial curve is presented in this paper. The quadratic trigonometric polynomial curve has C2 continuity, while the quadratic B-spline curve has C1 continuity. The quadratic trigonometric polynomial curve is closer to the given control polygon than the quadratic B-spline curve.
متن کاملDiscontinuous Piecewise Polynomial Neural Networks
An artificial neural network is presented based on the idea of connections between units that are only active for a specific range of input values and zero outside that range (and so are not evaluated outside the active range). The connection function is represented by a polynomial with compact support. The finite range of activation allows for great activation sparsity in the network and means...
متن کاملLocal Piecewise Polynomial Projection Methods
Local projection methods which yield c'm_1) piecewise polynomials of order m + k as approximate solutions of a boundary value problem for an mth order ordinary differential equation are determined by the k linear functional at which the residual error in each partition interval is required to vanish on. We develop a condition on these k f unctionals which implies breakpoint superconvergence (of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2009
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2009.05.001